Self-Stabilizing Depth-First Search
نویسندگان
چکیده
A distributed algorithm is self-stabilizing if it can be started from any possible global state. Once started, the algorithm converges to a consistent global state by itself. This paper presents a distributed self-stabilizing Depth First Search (DFS) spanning tree algorithm, whose output is a DFS spanning tree of the communication graph, kept in a distributed fashion.
منابع مشابه
A Self-stabilizing Algorithm For 3-Edge-Connectivity
Self-stabilization is a theoretical framework for fault-tolerance without external assistance. Adoption of self-stabilization in distributed systems has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 3-edgeconnectivity of an asynchronous distributed model of computation. A self-stabilizing depth-first search algorithm is ...
متن کامل2-Edge-Connectivity and 2-Vertex-Connectivity with Fault Containment
Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it ...
متن کاملSnap-Stabilizing Depth-First Search on Arbitrary Networks
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After th...
متن کاملA Snap-Stabilizing DFS with a Lower Space Requirement
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stabilizing depth-first search (DFS) wave protocol for arbitrary rooted networks working under an unfair daemon. However, this protocol needs O(N ) states per processors (where N is the number of processors) and needs ids on processor...
متن کاملSelf-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract)
Power-supply, a surprisingly simple and new general paradigm for the development of self-stabilizing algorithms in diierent models, is introduced. The paradigm is exempliied by developing simple and eecient self-stabilizing algorithms for leader election and either BFS or DFS spanning tree constructions, in strongly-connected unidirectional and bi-directional dynamic networks (synchronous and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 49 شماره
صفحات -
تاریخ انتشار 1994